System and method of indirect register access

ABSTRACT

Systems and methods are provided for managing access to registers. A system may include a set of direct registers and a set of indirect registers. The indirect registers may be accessed through the direct registers, and the direct registers may provide various features to provide faster access to the indirect registers. One of the direct registers may indicate access modes for accessing the indirect registers. The access modes may include auto-increment, auto-decrement, auto-reset, and no change modes. Based on the access mode, the currently accessed address may be automatically modified after accessing the indirect register at the address.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of U.S. patent application Ser. No.12/253,966, which was filed on Oct. 18, 2008, now U.S. Pat. No.8,209,521, which issued on Jun. 26, 2012.

BACKGROUND

1. Field of Invention

Embodiments of the invention relate generally to digital dataprocessing, and, more specifically, in certain embodiments, to providingand managing registers.

2. Description of Related Art

In the field of computing, pattern recognition tasks are increasinglychallenging. Ever larger volumes of data are transmitted betweencomputers, and the number of patterns that users wish to identify isincreasing. For example, spam or malware are often detected by searchingfor patterns in a data stream, e.g., particular phrases or pieces ofcode. The number of patterns increases with the variety of spam andmalware, as new patterns may be implemented to search for new variants.Searching a data stream for each of these patterns can form a computingbottleneck. Often, as the data stream is received, it is searched foreach pattern, one at a time. The delay before the system is ready tosearch the next portion of the data stream increases with the number ofpatterns. Thus, pattern recognition may slow the receipt of data.

Additionally, systems that perform the pattern recognition and the otherassociated processing may use multiple registers to store various data,such as search data, configuration parameters, status information,pattern-matching results, or the like. These “processor registers” maytypically be directly available to a processing unit of the system, forexample, in order to provide quick access as compared to other storagethat may be accessible to the processing unit. It may be appreciated,however, that many systems include a finite addressing space forrecording the physical location of various forms of memory, includingmain system memory (e.g., random access memory) as well as suchregisters. Further, certain systems, such as pattern-recognitionsystems, may include a large number of registers to enable configurationand operation of the system. If a system includes a large number ofregisters accessible by the processing unit, the remaining address spaceavailable for main system memory may be reduced and overall performanceof the system may be impacted.

BRIEF DESCRIPTION OF THE DRAWINGS

FIG. 1 depicts an example of system that searches a data stream;

FIG. 2 depicts an example of a pattern-recognition processor in thesystem of FIG. 1;

FIG. 3 depicts an example of a search-term cell in thepattern-recognition processor of FIG. 2;

FIGS. 4 and 5 depict the search-term cell of FIG. 3 searching the datastream for a single character;

FIGS. 6-8 depict a recognition module including several search-termcells searching the data stream for a word;

FIG. 9 depicts the recognition module configured to search the datastream for two words in parallel;

FIGS. 10-12 depict the recognition module searching according to asearch criterion that specifies multiple words with the same prefix;

FIG. 13 depicts the pattern recognition processor of FIG. 2 havingaccessible registers in accordance with an embodiment of the presentinvention;

FIG. 14 illustrates a system having direct and indirect registers of thepattern recognition processor of FIG. 2 in accordance with an embodimentof the present invention;

FIGS. 15A-15C illustrate operation of an auto-increment mode of anauto-change address mode in accordance with an embodiment of the presentinvention;

FIGS. 16A-16C illustrate operation of an auto-decrement mode of anauto-change address mode in accordance with an embodiment of the presentinvention; and

FIG. 17 depicts a process for writing to or reading from indirectregisters of a pattern recognition processor in accordance with anembodiment of the present invention.

DETAILED DESCRIPTION OF SPECIFIC EMBODIMENTS

FIG. 1 depicts an example of a system 10 that searches a data stream 12.The system 10 may include a pattern-recognition processor 14 thatsearches the data stream 12 according to search criteria 16.

Each search criterion may specify one or more target expressions, i.e.,patterns. The phrase “target expression” refers to a sequence of datafor which the pattern-recognition processor 14 is searching. Examples oftarget expressions include a sequence of characters that spell a certainword, a sequence of genetic base pairs that specify a gene, a sequenceof bits in a picture or video file that form a portion of an image, asequence of bits in an executable file that form a part of a program, ora sequence of bits in an audio file that form a part of a song or aspoken phrase.

A search criterion may specify more than one target expression. Forexample, a search criterion may specify all five-letter words beginningwith the sequence of letters “cl”, any word beginning with the sequenceof letters “cl”, a paragraph that includes the word “cloud” more thanthree times, etc. The number of possible sets of target expressions isarbitrarily large, e.g., there may be as many target expressions asthere are permutations of data that the data stream could present. Thesearch criteria may be expressed in a variety of formats, including asregular expressions, a programming language that concisely specifiessets of target expressions without necessarily listing each targetexpression.

Each search criterion may be constructed from one or more search terms.Thus, each target expression of a search criterion may include one ormore search terms and some target expressions may use common searchterms. As used herein, the phrase “search term” refers to a sequence ofdata that is searched for, during a single search cycle. The sequence ofdata may include multiple bits of data in a binary format or otherformats, e.g., base ten, ASCII, etc. The sequence may encode the datawith a single digit or multiple digits, e.g., several binary digits. Forexample, the pattern-recognition processor 14 may search a text datastream 12 one character at a time, and the search terms may specify aset of single characters, e.g., the letter “a”, either the letters “a”or “e”, or a wildcard search term that specifies a set of all singlecharacters.

Search terms may be smaller or larger than the number of bits thatspecify a character (or other grapheme—i.e., fundamental unit—of theinformation expressed by the data stream, e.g., a musical note, agenetic base pair, a base-10 digit, or a sub-pixel). For instance, asearch term may be 8 bits and a single character may be 16 bits, inwhich case two consecutive search terms may specify a single character.

The search criteria 16 may be formatted for the pattern-recognitionprocessor 14 by a compiler 18. Formatting may include deconstructingsearch terms from the search criteria. For example, if the graphemesexpressed by the data stream 12 are larger than the search terms, thecompiler may deconstruct the search criterion into multiple search termsto search for a single grapheme. Similarly, if the graphemes expressedby the data stream 12 are smaller than the search terms, the compiler 18may provide a single search term, with unused bits, for each separategrapheme. The compiler 18 may also format the search criteria 16 tosupport various regular expressions operators that are not nativelysupported by the pattern-recognition processor 14.

The pattern-recognition processor 14 may search the data stream 12 byevaluating each new term from the data stream 12. The word “term” hererefers to the amount of data that could match a search term. During asearch cycle, the pattern-recognition processor 14 may determine whetherthe currently presented term matches the current search term in thesearch criterion. If the term matches the search term, the evaluation is“advanced”, i.e., the next term is compared to the next search term inthe search criterion. If the term does not match, the next term iscompared to the first term in the search criterion, thereby resettingthe search.

Each search criterion may be compiled into a different finite statemachine in the pattern-recognition processor 14. The finite statemachines may run in parallel, searching the data stream 12 according tothe search criteria 16. The finite state machines may step through eachsuccessive search term in a search criterion as the preceding searchterm is matched by the data stream 12, or if the search term isunmatched, the finite state machines may begin searching for the firstsearch term of the search criterion.

The pattern-recognition processor 14 may evaluate each new termaccording to several search criteria, and their respective search terms,at about the same time, e.g., during a single device cycle. The parallelfinite state machines may each receive the term from the data stream 12at about the same time, and each of the parallel finite state machinesmay determine whether the term advances the parallel finite statemachine to the next search term in its search criterion. The parallelfinite state machines may evaluate terms according to a relatively largenumber of search criteria, e.g., more than 100, more than 1000, or morethan 10,000. Because they operate in parallel, they may apply the searchcriteria to a data stream 12 having a relatively high bandwidth, e.g., adata stream 12 of greater than or generally equal to 64 MB per second or128 MB per second, without slowing the data stream. In some embodiments,the search-cycle duration does not scale with the number of searchcriteria, so the number of search criteria may have little to no effecton the performance of the pattern-recognition processor 14.

When a search criterion is satisfied (i.e., after advancing to the lastsearch term and matching it), the pattern-recognition processor 14 mayreport the satisfaction of the criterion to a processing unit, such as acentral processing unit (CPU) 20. The central processing unit 20 maycontrol the pattern-recognition processor 14 and other portions of thesystem 10.

The system 10 may be any of a variety of systems or devices that searcha stream of data. For example, the system 10 may be a desktop, laptop,handheld or other type of computer that monitors the data stream 12. Thesystem 10 may also be a network node, such as a router, a server, or aclient (e.g., one of the previously-described types of computers). Thesystem 10 may be some other sort of electronic device, such as a copier,a scanner, a printer, a game console, a television, a set-top videodistribution or recording system, a cable box, a personal digital mediaplayer, a factory automation system, an automotive computer system, or amedical device. (The terms used to describe these various examples ofsystems, like many of the other terms used herein, may share somereferents and, as such, should not be construed narrowly in virtue ofthe other items listed.)

The data stream 12 may be one or more of a variety of types of datastreams that a user or other entity might wish to search. For example,the data stream 12 may be a stream of data received over a network, suchas packets received over the Internet or voice or data received over acellular network. The data stream 12 may be data received from a sensorin communication with the system 10, such as an imaging sensor, atemperature sensor, an accelerometer, or the like, or combinationsthereof. The data stream 12 may be received by the system 10 as a serialdata stream, in which the data is received in an order that has meaning,such as in a temporally, lexically, or semantically significant order.Alternatively, the data stream 12 may be received in parallel or out oforder and, then, converted into a serial data stream, e.g., byreordering packets received over the Internet. In some embodiments, thedata stream 12 may present terms serially, but the bits expressing eachof the terms may be received in parallel. The data stream 12 may bereceived from a source external to the system 10, or may be formed byinterrogating a memory device and forming the data stream 12 from storeddata.

Depending on the type of data in the data stream 12, different types ofsearch criteria may be chosen by a designer. For instance, the searchcriteria 16 may be a virus definition file. Viruses or other malware maybe characterized, and aspects of the malware may be used to form searchcriteria that indicate whether the data stream 12 is likely deliveringmalware. The resulting search criteria may be stored on a server, and anoperator of a client system may subscribe to a service that downloadsthe search criteria to the system 10. The search criteria 16 may beperiodically updated from the server as different types of malwareemerge. The search criteria may also be used to specify undesirablecontent that might be received over a network, for instance unwantedemails (commonly known as spam) or other content that a user findsobjectionable.

The data stream 12 may be searched by a third party with an interest inthe data being received by the system 10. For example, the data stream12 may be monitored for text, a sequence of audio, or a sequence ofvideo that occurs in a copyrighted work. The data stream 12 may bemonitored for utterances that are relevant to a criminal investigationor civil proceeding or are of interest to an employer.

The search criteria 16 may also include patterns in the data stream 12for which a translation is available, e.g., in memory addressable by theCPU 20 or the pattern-recognition processor 14. For instance, the searchcriteria 16 may each specify an English word for which a correspondingSpanish word is stored in memory. In another example, the searchcriteria 16 may specify encoded versions of the data stream 12, e.g.,MP3, MPEG 4, FLAC, Ogg Vorbis, etc., for which a decoded version of thedata stream 12 is available, or vice versa.

The pattern-recognition processor 14 may be hardware that is integratedwith the CPU 20 into a single component (such as a single device) or maybe formed as a separate component. For instance, the pattern-recognitionprocessor 14 may be a separate integrated circuit. Thepattern-recognition processor 14 may be referred to as a “co-processor”or a “pattern-recognition co-processor”.

FIG. 2 depicts an example of the pattern-recognition processor 14. Thepattern-recognition processor 14 may include a recognition module 22 andan aggregation module 24. The recognition module 22 may be configured tocompare received terms to search terms, and both the recognition module22 and the aggregation module 24 may cooperate to determine whethermatching a term with a search term satisfies a search criterion.

The recognition module 22 may include a row decoder 28 and a pluralityof feature cells 30. Each feature cell 30 may specify a search term, andgroups of feature cells 30 may form a parallel finite state machine thatforms a search criterion. Components of the feature cells 30 may form asearch-term array 32, a detection array 34, and an activation-routingmatrix 36. The search-term array 32 may include a plurality of inputconductors 37, each of which may place each of the feature cells 30 incommunication with the row decoder 28.

The row decoder 28 may select particular conductors among the pluralityof input conductors 37 based on the content of the data stream 12. Forexample, the row decoder 28 may be a one byte to 256 row decoder thatactivates one of 256 rows based on the value of a received byte, whichmay represent one term. A one-byte term of 0000 0000 may correspond tothe top row among the plurality of input conductors 37, and a one-byteterm of 1111 1111 may correspond to the bottom row among the pluralityof input conductors 37. Thus, different input conductors 37 may beselected, depending on which terms are received from the data stream 12.As different terms are received, the row decoder 28 may deactivate therow corresponding to the previous term and activate the rowcorresponding to the new term.

The detection array 34 may couple to a detection bus 38 that outputssignals indicative of complete or partial satisfaction of searchcriteria to the aggregation module 24. The activation-routing matrix 36may selectively activate and deactivate feature cells 30 based on thenumber of search terms in a search criterion that have been matched.

The aggregation module 24 may include a latch matrix 40, anaggregation-routing matrix 42, a threshold-logic matrix 44, alogical-product matrix 46, a logical-sum matrix 48, and aninitialization-routing matrix 50.

The latch matrix 40 may implement portions of certain search criteria.Some search criteria, e.g., some regular expressions, count only thefirst occurrence of a match or group of matches. The latch matrix 40 mayinclude latches that record whether a match has occurred. The latchesmay be cleared during initialization, and periodically re-initializedduring operation, as search criteria are determined to be satisfied ornot further satisfiable—i.e., an earlier search term may need to bematched again before the search criterion could be satisfied.

The aggregation-routing matrix 42 may function similar to theactivation-routing matrix 36. The aggregation-routing matrix 42 mayreceive signals indicative of matches on the detection bus 38 and mayroute the signals to different group-logic lines 53 connecting to thethreshold-logic matrix 44. The aggregation-routing matrix 42 may alsoroute outputs of the initialization-routing matrix 50 to the detectionarray 34 to reset portions of the detection array 34 when a searchcriterion is determined to be satisfied or not further satisfiable.

The threshold-logic matrix 44 may include a plurality of counters, e.g.,32-bit counters configured to count up or down. The threshold-logicmatrix 44 may be loaded with an initial count, and it may count up ordown from the count based on matches signaled by the recognition module.For instance, the threshold-logic matrix 44 may count the number ofoccurrences of a word in some length of text.

The outputs of the threshold-logic matrix 44 may be inputs to thelogical-product matrix 46. The logical-product matrix 46 may selectivelygenerate “product” results (e.g., “AND” function in Boolean logic). Thelogical-product matrix 46 may be implemented as a square matrix, inwhich the number of output products is equal the number of input linesfrom the threshold-logic matrix 44, or the logical-product matrix 46 mayhave a different number of inputs than outputs. The resulting productvalues may be output to the logical-sum matrix 48.

The logical-sum matrix 48 may selectively generate sums (e.g., “OR”functions in Boolean logic.) The logical-sum matrix 48 may also be asquare matrix, or the logical-sum matrix 48 may have a different numberof inputs than outputs. Since the inputs are logical products, theoutputs of the logical-sum matrix 48 may be logical-Sums-of-Products(e.g., Boolean logic Sum-of-Product (SOP) form). The output of thelogical-sum matrix 48 may be received by the initialization-routingmatrix 50.

The initialization-routing matrix 50 may reset portions of the detectionarray 34 and the aggregation module 24 via the aggregation-routingmatrix 42. The initialization-routing matrix 50 may also be implementedas a square matrix, or the initialization-routing matrix 50 may have adifferent number of inputs than outputs. The initialization-routingmatrix 50 may respond to signals from the logical-sum matrix 48 andre-initialize other portions of the pattern-recognition processor 14,such as when a search criterion is satisfied or determined to be notfurther satisfiable.

The aggregation module 24 may include an output buffer 51 that receivesthe outputs of the threshold-logic matrix 44, the aggregation-routingmatrix 42, and the logical-sum matrix 48. The output of the aggregationmodule 24 may be transmitted from the output buffer 51 to the CPU 20(FIG. 1) on the output bus 26. In some embodiments, an outputmultiplexer may multiplex signals from these components 42, 44, and 48and output signals indicative of satisfaction of criteria or matches ofsearch terms to the CPU 20 (FIG. 1). In other embodiments, results fromthe pattern-recognition processor 14 may be reported withouttransmitting the signals through the output multiplexer, which is not tosuggest that any other feature described herein could not also beomitted. For example, signals from the threshold-logic matrix 44, thelogical-product matrix 46, the logical-sum matrix 48, or theinitialization routing matrix 50 may be transmitted to the CPU inparallel on the output bus 26.

FIG. 3 illustrates a portion of a single feature cell 30 in thesearch-term array 32 (FIG. 2), a component referred to herein as asearch-term cell 54. The search-term cells 54 may include an outputconductor 56 and a plurality of memory cells 58. Each of the memorycells 58 may be coupled to both the output conductor 56 and one of theconductors among the plurality of input conductors 37. In response toits input conductor 37 being selected, each of the memory cells 58 mayoutput a value indicative of its stored value, outputting the datathrough the output conductor 56. In some embodiments, the plurality ofinput conductors 37 may be referred to as “word lines”, and the outputconductor 56 may be referred to as a “data line”.

The memory cells 58 may include any of a variety of types of memorycells. For example, the memory cells 58 may be volatile memory, such asdynamic random access memory (DRAM) cells having a transistor and acapacitor. The source and the drain of the transistor may be connectedto a plate of the capacitor and the output conductor 56, respectively,and the gate of the transistor may be connected to one of the inputconductors 37. In another example of volatile memory, each of the memorycells 58 may include a static random access memory (SRAM) cell. The SRAMcell may have an output that is selectively coupled to the outputconductor 56 by an access transistor controlled by one of the inputconductors 37. The memory cells 58 may also include nonvolatile memory,such as phase-change memory (e.g., an ovonic device), flash memory,silicon-oxide-nitride-oxide-silicon (SONOS) memory, magneto-resistivememory, or other types of nonvolatile memory. The memory cells 58 mayalso include flip-flops, e.g., memory cells made out of logic gates.

FIGS. 4 and 5 depict an example of the search-term cell 54 in operation.FIG. 4 illustrates the search-term cell 54 receiving a term that doesnot match the cell's search term, and FIG. 5 illustrates a match.

As illustrated by FIG. 4, the search-term cell 54 may be configured tosearch for one or more terms by storing data in the memory cells 58. Thememory cells 58 may each represent a term that the data stream 12 mightpresent, e.g., in FIG. 3, each memory cell 58 represents a single letteror number, starting with the letter “a” and ending with the number “9”.Memory cells 58 representing terms that satisfy the search term may beprogrammed to store a first value, and memory cells 58 that do notrepresent terms that satisfy the search term may be programmed to storea different value. In the illustrated example, the search-term cell 54is configured to search for the letter “b”. The memory cells 58 thatrepresent “b” may store a 1, or logic high, and the memory cells 58 thatdo not represent “b” may be programmed to store a 0, or logic low.

To compare a term from the data stream 12 with the search term, the rowdecoder 28 may select the input conductor 37 coupled to memory cells 58representing the received term. In FIG. 4, the data stream 12 presents alowercase “e”. This term may be presented by the data stream 12 in theform of an eight-bit ASCII code, and the row decoder 28 may interpretthis byte as a row address, outputting a signal on the conductor 60 byenergizing it.

In response, the memory cell 58 controlled by the conductor 60 mayoutput a signal indicative of the data that the memory cell 58 stores,and the signal may be conveyed by the output conductor 56. In this case,because the letter “e” is not one of the terms specified by thesearch-term cell 54, it does not match the search term, and thesearch-term cell 54 outputs a 0 value, indicating no match was found.

In FIG. 5, the data stream 12 presents a character “b”. Again, the rowdecoder 28 may interpret this term as an address, and the row decoder 28may select the conductor 62. In response, the memory cell 58representing the letter “b” outputs its stored value, which in this caseis a 1, indicating a match.

The search-term cells 54 may be configured to search for more than oneterm at a time. Multiple memory cells 58 may be programmed to store a 1,specifying a search term that matches with more than one term. Forinstance, the memory cells 58 representing the letters lowercase “a” anduppercase “A” may be programmed to store a 1, and the search-term cell54 may search for either term. In another example, the search-term cell54 may be configured to output a match if any character is received. Allof the memory cells 58 may be programmed to store a 1, such that thesearch-term cell 54 may function as a wildcard term in a searchcriterion.

FIGS. 6-8 depict the recognition module 22 searching according to amulti-term search criterion, e.g., for a word. Specifically, FIG. 6illustrates the recognition module 22 detecting the first letter of aword, FIG. 7 illustrates detection of the second letter, and FIG. 8illustrates detection of the last letter.

As illustrated by FIG. 6, the recognition module 22 may be configured tosearch for the word “big”. Three adjacent feature cells 63, 64, and 66are illustrated. The feature cell 63 is configured to detect the letter“b”. The feature cell 64 is configured to detect the letter “i”. Thefeature cell 66 is configured to both detect the letter “g” and indicatethat the search criterion is satisfied.

FIG. 6 also depicts additional details of the detection array 34. Thedetection array 34 may include a detection cell 68 in each of thefeature cells 63, 64, and 66. Each of the detection cells 68 may includea memory cell 70, such as one of the types of memory cells describedabove (e.g., a flip-flop), that indicates whether the feature cell 63,64, or 66 is active or inactive. The detection cells 68 may beconfigured to output a signal to the activation-routing matrix 36indicating whether the detection cells 68 are active and has received asignal from its associated search-term cell 54 indicating a match.Inactive features cells 63, 64, and 66 may disregard matches. Each ofthe detection cells 68 may include an AND gate with inputs from thememory cell 70 and the output conductor 56. The output of the AND gatemay be routed to both the detection bus 38 and the activation-routingmatrix 36, or one or the other.

The activation-routing matrix 36, in turn, may selectively activate thefeature cells 63, 64, and 66 by writing to the memory cells 70 in thedetection array 34. The activation-routing matrix 36 may activatefeature cells 63, 64, or 66 according to the search criterion and whichsearch term is being searched for next in the data stream 12.

In FIG. 6, the data stream 12 presents the letter “b”. In response, eachof the feature cells 63, 64, and 66 may output a signal on their outputconductor 56, indicating the value stored in the memory cell 58connected to the conductor 62, which represents the letter “b”. Thedetection cells 56 may then each determine whether they have received asignal indicating a match and whether they are active. Because thefeature cell 63 is configured to detect the letter “b” and is active, asindicated by its memory cell 70, the detection cell 68 in the featurecell 63 may output a signal to the activation-routing matrix 36indicating that the first search term of the search criterion has beenmatched.

As illustrated by FIG. 7, after the first search term is matched, theactivation-routing matrix 36 may activate the next feature cell 64 bywriting a 1 to its memory cell 70 in its detection cell 68. Theactivation-routing matrix 36 may also maintain the active state of thefeature cell 63, in case the next term satisfies the first search term,e.g., if the sequence of terms “bbig” is received. The first search termof search criteria may be maintained in an active state during a portionor substantially all of the time during which the data stream 12 issearched.

In FIG. 7, the data stream 12 presents the letter “i” to the recognitionmodule 22. In response, each of the feature cells 63, 64, and 66 mayoutput a signal on their output conductor 56, indicating the valuestored in the memory cell 58 connected to the conductor 72, whichrepresents the letter “i”. The detection cells 56 may then eachdetermine whether they have received a signal indicating a match andwhether they are active. Because the feature cell 64 is configured todetect the letter “i” and is active, as indicated by its memory cell 70,the detection cell 68 in the feature cell 64 may output a signal to theactivation-routing matrix 36 indicating that the next search term of itssearch criterion has been matched.

Next, the activation-routing matrix 36 may activate the feature cell 66,as illustrated by FIG. 8. Before evaluating the next term, the featurecell 64 may be deactivated. The feature cell 64 may be deactivated byits detection cell 68 resetting its memory cell 70 between detectioncycles or the activation-routing matrix 36 may deactivate the featurecell 64, for example.

In FIG. 8, the data stream 12 presents the term “g” to the row decoder28, which selects the conductor 74 representing the term “g”. Inresponse, each of the feature cells 63, 64, and 66 may output a signalon their output conductor 56, indicating the value stored in the memorycell 58 connected to the conductor 74, which represents the letter “g”.The detection cells 68 may then each determine whether they havereceived a signal indicating a match and whether they are active.Because the feature cell 66 is configured to detect the letter “g” andis active, as indicated by its memory cell 70, the detection cell 68 inthe feature cell 66 may output a signal to the activation routing matrix36 indicating that the last search term of its search criterion has beenmatched.

The end of a search criterion or a portion of a search criterion may beidentified by the activation-routing matrix 36 or the detection cell 68.These components 36 or 68 may include memory indicating whether theirfeature cell 63, 64, or 66 specifies the last search term of a searchcriterion or a component of a search criterion. For example, a searchcriterion may specify all sentences in which the word “cattle” occurstwice, and the recognition module may output a signal indicating eachoccurrence of “cattle” within a sentence to the aggregation module,which may count the occurrences to determine whether the searchcriterion is satisfied.

Feature cells 63, 64, or 66 may be activated under several conditions. Afeature cell 63, 64, or 66 may be “always active”, meaning that itremains active during all or substantially all of a search. An exampleof an always active feature cell 63, 64, or 66 is the first feature cellof the search criterion, e.g., feature cell 63.

A feature cell 63, 64, or 66 may be “active when requested”, meaningthat the feature cell 63, 64, or 66 is active when some conditionprecedent is matched, e.g., when the preceding search terms in a searchcriterion are matched. An example is the feature cell 64, which isactive when requested by the feature cell 63 in FIGS. 6-8, and thefeature cell 66, which is active when requested by the feature cell 64.

A feature cell 63, 64, or 66 may be “self activated”, meaning that onceit is activated, it activates itself as long as its search term ismatched. For example, a self activated feature cell having a search termthat is matched by any numerical digit may remain active through thesequence “123456xy” until the letter “x” is reached. Each time thesearch term of the self activated feature cell is matched, it mayactivate the next feature cell in the search criterion. Thus, an alwaysactive feature cell may be formed from a self activating feature celland an active when requested feature cell. The self activating featurecell may be programmed with all of its memory cells 58 storing a 1, andit may repeatedly activate the active when requested feature cell aftereach term. In some embodiments, each feature cell 63, 64, and 66 mayinclude a memory cell in its detection cell 68 or in theactivation-routing matrix 36 that specifies whether the feature cell isalways active, thereby forming an always active feature cell from asingle feature cell.

FIG. 9 depicts an example of a recognition module 22 configured tosearch according to a first search criterion 75 and a second searchcriterion 76 in parallel. In this example, the first search criterion 75specifies the word “big”, and the second search criterion 76 specifiesthe word “cab”. A signal indicative of the current term from the datastream 12 may be communicated to feature cells in each search criterion75 and 76 at generally the same time. Each of the input conductors 37spans both of the search criteria 75 and 76. As a result, in someembodiments, both of the search criteria 75 and 76 may evaluate thecurrent term generally simultaneously. This is believed to speed theevaluation of search criteria. Other embodiments may include morefeature cells configured to evaluate more search criteria in parallel.For example, some embodiments may include more than 100, 500, 1000,5000, or 10,000 feature cells operating in parallel. These feature cellsmay evaluate hundreds or thousands of search criteria generallysimultaneously.

Search criteria with different numbers of search terms may be formed byallocating more or fewer feature cells to the search criteria. Simplesearch criteria may consume fewer resources in the form of feature cellsthan complex search criteria. This is believed to reduce the cost of thepattern-recognition processor 14 (FIG. 2) relative to processors with alarge number of generally identical cores, all configured to evaluatecomplex search criteria.

FIGS. 10-12 depict both an example of a more complex search criterionand features of the activation-routing matrix 36. The activation-routingmatrix 36 may include a plurality of activation-routing cells 78, groupsof which may be associated with each of the feature cells 63, 64, 66,80, 82, 84, and 86. For instance, each of the feature cells may include5, 10, 20, 50, or more activation-routing cells 78. Theactivation-routing cells 78 may be configured to transmit activationsignals to the next search term in a search criterion when a precedingsearch term is matched. The activation-routing cells 78 may beconfigured to route activation signals to adjacent feature cells orother activation-routing cells 78 within the same feature cell. Theactivation-routing cells 78 may include memory that indicates whichfeature cells correspond to the next search term in a search criterion.

As illustrated by FIGS. 10-12, the recognition module 22 may beconfigured to search according to complex search criteria than criteriathat specify single words. For instance, the recognition module 22 maybe configured to search for words beginning with a prefix 88 and endingwith one of two suffixes 90 or 92. The illustrated search criterionspecifies words beginning with the letters “c” and “l” in sequence andending with either the sequence of letters “ap” or the sequence ofletters “oud”. This is an example of a search criterion specifyingmultiple target expressions, e.g., the word “clap” or the word “cloud”.

In FIG. 10, the data stream 12 presents the letter “c” to therecognition module 22, and feature cell 63 is both active and detects amatch. In response, the activation-routing matrix 36 may activate thenext feature cell 64. The activation-routing matrix 36 may also maintainthe active state of the feature cell 63, as the feature cell 63 is thefirst search term in the search criterion.

In FIG. 11, the data stream 12 presents a letter “l”, and the featurecell 64 recognizes a match and is active. In response, theactivation-routing matrix 36 may transmit an activation signal both tothe first feature cell 66 of the first suffix 90 and to the firstfeature cell 82 of the second suffix 92. In other examples, moresuffixes may be activated, or multiple prefixes may active one or moresuffixes.

Next, as illustrated by FIG. 12, the data stream 12 presents the letter“o” to the recognition module 22, and the feature cell 82 of the secondsuffix 92 detects a match and is active. In response, theactivation-routing matrix 36 may activate the next feature cell 84 ofthe second suffix 92. The search for the first suffix 90 may die out, asthe feature cell 66 is allowed to go inactive. The steps illustrated byFIGS. 10-12 may continue through the letters “u” and “d”, or the searchmay die out until the next time the prefix 88 is matched.

In some embodiments, such as that illustrated in FIG. 13, thepattern-recognition processor 14 may be part of a device 93 accessed bya controller or some other device or system, such as a host computersystem 94. The computer system 94 may include, for example, a processor,such as a central processing unit (CPU) 20, that accesses a memory 95via a memory management unit (MMU) 96. The memory 95 may include anysuitable memory device, including, but not limited to, static randomaccess memory (SRAM), dynamic random access memory (DRAM), or ageneration of Double Data Rate (DDR) memory (e.g., DDR1, DDR2, DDR3, orDDR4). Further, the MMU 96 may be provided in a separate hardwarecomponent of the system 94, such as a northbridge of a motherboardchipset, or may be integrated into the CPU 20. Although device 93 ispresently illustrated as separate from the computer system 94, it willbe appreciated that some or all of the components of the device 93 andthe computer system 94, including, but not limited to, those explicitlyillustrated in FIG. 13 and discussed herein, may be integrated into asingle device.

As described further below, in some embodiments the pattern-recognitionprocessor 14, or the device 94 having the pattern-recognition processor14, may include a plurality of registers 97 to store information relatedto the pattern-recognition system described above. To facilitate readingand writing data to and from the registers 97, register access logic 98may manage the access to the registers 97. The register access logic 98may be implemented in hardware, or in any other suitable manner. Invarious embodiments, the registers 97 and/or register access logic 98may be a part of the pattern recognition processor 14, or may beseparate from but accessible by the pattern recognition processor 14.

The plurality of registers 97 may include registers that store matchingresults, counts, configuration information, control information andstatus, debug information, etc. Any desirable information related to thepattern recognition process described above may be stored in theregisters 97. The large quantity of data that may be stored in theregisters 97 may result in a relatively large number of registers.

The MMU 96 may use an address map 99, which includes physical memoryaddresses directly accessible by the CPU 20, to facilitate direct accessby the CPU 20 to various memory locations, such as within the memory 95and the registers 97. The address map 99, however, may have a finitenumber of addresses that can be mapped to physical memory locations ofthe system 94 and other devices, such as device 93. For instance, insome embodiments, the system 94 may include a 32-bit address bus thatallows 2³² distinct addresses to be mapped to physical memory locationsin the address map 99. In such an embodiment, and given an address spaceof a fixed size, the number of addresses that may be mapped to physicallocations in the memory 95 is inversely related to the number ofaddresses mapped to physical locations outside the memory 95, such as inthe registers 97. For instance, if each address is mapped to a one-bytephysical memory location, 2³² available addresses could be mapped to,and allow direct access by the CPU 20 of, 4 GB of memory. If asubstantial number of addresses within the address map 99 were allocatedto the registers 97, fewer addresses would be available for mapping tothe memory 95, which may reduce the amount of memory 95 accessible tothe CPU 20 and result in decreased performance of the system 94. In someembodiments, address space of the system 94 and the address map 99 maybe conserved through the indirect addressing techniques discussed below.

In accordance with certain embodiments of the present invention, amajority of the registers 97 may be indirectly accessible by the system94 (and not included within the address space of the system 94 oraddress map 99), while a specific subset of registers 97 may be directlyaccessible by, and included within the memory space of, the system 94.These two types of registers may be referred to as “indirect registers”and “direct registers,” respectively. That is, in order to preservememory address space of a processing system, such as the system 94, alarge number of registers may be logically and/or physically locatedsuch that they are not directly accessible by the processing unit. Theseregisters may be of any desired size, such as 8-bit registers, 16-bitregisters, 32-bit registers, 36-bit registers, 64-bit registers, or thelike.

In one embodiment, the device 93 includes a separate address map 101that may be used to facilitate access to physical locations of theregisters 97, and that generally provides a map to the indirectregisters not included in the address map 99 of the system 94. Asdiscussed further below, the direct registers also allow access to theindirect registers, and can be used to funnel all requests for access tothe indirect registers through the easily accessed direct registers. Thedirect registers allow rapid access by the system 94 (e.g., by the CPU20), yet restriction of the direct registers to a subset of theregisters 97 reduces the amount of memory address space within system 94used for the registers 97. Additionally, in some embodiments, varioustechniques may speed up accesses to the indirect registers, reducing anysystem slowdowns caused by accessing these indirect registers. While theindirect addressing technique disclosed herein may be employed inconjunction with a pattern-recognition processor in some embodiments,such indirect addressing may also be used in other embodiments that donot include such a pattern-recognition processor.

FIG. 14 illustrates a system 100 having direct and indirect registers ofthe pattern recognition processor 14 in accordance with an embodiment ofthe present invention. The system 100 includes a direct register set (orgroup) 102 (also referred to as a “base register set”), and an indirectregister set (or group) 104. The base register set 102 may include anynumber of “critical” registers, that is, those registers where directaccessibility by the system 94 (or some other controller, system, ordevice) is most desired. In the embodiment illustrated in FIG. 14, thebase register set 102 includes six registers, although in otherembodiments any number of registers may be used in the base register set102. Further, it should be appreciated that selection of the “critical”registers used in the base register set 102 is configurable based on thepattern recognition processor 14 and the system. Thus, in otherembodiments, some of the registers of the base register set 102 in FIG.14 may be omitted and other registers may be included in the baseregister set 102.

In the illustrated embodiment, the base register set 102 includes thefollowing registers: a critical status register 106; a critical controlregister 108; a stimulus byte input register 110, an indirect bankselect register 112; an indirect address select register 114; and anindirect data in/out register 116. In one embodiment, each register ofthe base register set 102 may be a 32-bit register, and may beaccessible over a 32-bit address bus. Further, the registers of theregister set 102 may be read/write registers, allowing both reads andwrites. As described further below, the indirect bank select register112, the indirect address select register 114, and the indirect datain/out register 116 aid in accessing the indirect registers 104. Thesethree registers 112, 114, and 116 may collectively be referred to as the“indirect addressing access registers.”

The critical status register 106, the critical control register 108, andthe stimulus byte input register 110 provide access to functions andinformation that may be quickly accessed by the system 94 or some othercontroller, preventing the access delay associated with providing thesefunctions and information via the indirect registers 104. The criticalcontrol register 108 provides critical control bits during the patternmatching operation when speed of processing is critical. For example,such bits may include stop/run, reset, DMA start/stop, mode selection,etc. Any other critical control bits may be used in the critical controlregister 108.

The critical status register 106 provides critical status informationduring the pattern matching operation. The status information bitsstored in the register 106 may be “sticky” bits (updated only whenexplicitly requested), may be “auto-updated,” or may never be updated.Examples of status bits stored in the register 106 may includeendian-mode, endian-ness selection, DMA mode, DMA status, status ofmatches, detection of matches, etc.

The stimulus-byte input register 110 provides storage of the data to besearched from the data stream 12. Storing the data in the stimulus-byteinput register 110 allows parallel functions to occur, speeding upoperation of the pattern recognition processor 14. For example, datafrom the data stream 12 can be processed at the same time as reading ofindirect “match results” bank registers.

The indirect register set 104 may include any number of register banks118 comprising one or more registers 120. Various types of indirectregister groups are described below. However, it should be appreciatedthat the groups described are merely exemplary and any other registers,register groups, and/or register banks may be included. The indirectregister set 104 may include a flow save and restore group 122, a matchresult and debug group 124, a power-on configuration group 126, and apattern configuration group 128. The flow save and restore group 122 mayinclude status indicators and counter values, such as thresholdcounters, processed byte counters, etc. The match results and debuggroup 124 may include group logic outputs, recognition array outputs,and any other results and outputs. The power-on configuration group 126includes registers identifying and configuring the pattern recognitionprocessor 14, such as device capabilities, manufacturer identificationcodes, system parameters, etc. Finally, the pattern configuration group128 includes functions and information used with the pattern recognitionprocess, such as recognition array state, aggregation functions, etc.

In some embodiments, accessing an indirect register may require three ormore bus cycles, such as selecting a register bank, selecting anindirect register within the bank, and then writing or receiving data toor from the indirect register. In accordance with an embodiment of thepresent invention, however, the indirect addressing access registers112, 114, and 116 provide a system for decreasing access time to theindirect register set 104. The indirect bank select register 112 selectsthe bank 118 of the indirect register set 104 to be accessed. Each ofthe various banks 118 may be selected by a specific address value, asindicated by a bank select bus line 119. In one embodiment, the indirectbank select register 112 may be a 32-bit register. As described in moredetail below, some bits of the indirect bank select register 112 may beused to select the “auto-change address mode” for the selected registerbank. Additionally, writing to the indirect bank select register 112 mayautomatically set the indirect address select register 114 to apredetermined value. In one embodiment, such writing may automaticallyreset the indirect address select register 114 to zero (e.g.,0x00000000h for a 32-bit register).

The indirect address select register 114 sets the specific register 120to be accessed within the bank of registers selected by the indirectbank register select 112, as indicated by register address bus 121. Ineach selected bank, the registers start at a zero address. In someembodiments, because the indirect address select register 114 is set tozero after writing to the indirect bank select register 112, theindirect address select register 114 may be written with the desiredaddress after the indirect bank select register 112 is written. Asdescribed further below, the indirect address select register 114 iscapable of “auto-increment,” “auto-decrement,” “auto-reset,” and “nochange” modes (referred to as “auto-change address modes”) that increaseperformance when doing successive reads or writes to consecutiveregister addresses.

The indirect data in/out register 116 provides the write or readfunctionality for the indirect register set 104, as indicated by theregister data in/out bus 123. Writing to the indirect data in/outregister 116 writes data into the register at the address specified bythe indirect bank select register 112 and the indirect address selectregister 114. Reading from the indirect data in/out register 116 readsthe register at the address specified by the combination of the indirectbank select register 112 and the indirect address select register 114.Thus, by using the indirect bank select register 112, the indirectaddress select register 114, and the indirect data in/out register 116,data may be written to or read from the indirect registers 104.

Because accessing each of the indirect registers 104 requires accessingthe registers 112, 114, and 116, access to the indirect registers 104may be appreciably slower than accessing the direct registers 102. Asmentioned above, to speed up access to the banks of the indirectregister set 104, the pattern recognition processor 14 and the registerlogic 96 may utilize one or more auto-change address modes. In oneembodiment, the auto-change address mode may be set via one or more bitsof the indirect bank select register 112. These bits may be referred toas “auto change address bits.” In other embodiments, any register may beused to set and store the auto change address bits.

The auto-change address modes may include various modes to speed upaccess to consecutive registers of the banks 118 of the indirectregisters 104, or may include modes to quickly reset the indirectaddress select register 114. In one embodiment, these modes may includean “auto-increment” mode, an “auto-decrement” mode, and an “auto-reset”mode. Additionally, a “no-change” mode may be selected.

In the auto-increment mode, the currently accessed register addressspecified by the indirect address select register 114 is incremented atthe completion of the current indirect data in/out register bus cycle.Similarly, in the auto-decrement mode, the currently accessed registeraddress specified by the indirect address select register 114 isdecremented at the completion of the current indirect data in/outregister bus cycle. If the auto-reset mode is selected, the indirectaddress select register 114 is set to a predetermined value (e.g., zeroin an “auto-reset-to-zero” mode) at the completion of the current cycle.If the no change mode is selected, no change is made to the currentlyselected register address specified by the indirect address selectregister 114 at the completion of the current cycle. The auto-changeaddress modes for the embodiment described above are summarized in Table1.

TABLE 1 Summary of auto-change address modes Address for CurrentAuto-Change Selection Access Address for Next Access None <address><address> Auto-Increment <address> <address> + 1 Auto-Decrement<address> <address> − 1 Auto-Reset-to-Zero <address> 0x00000000h

It should be appreciated that various embodiments may include any one ormore of the auto-change address modes described above. In otherembodiments, any other auto-change address modes that modify a currentlyaccessed register address may be implemented, including logicaloperators (such as AND, OR, XOR, and the like), HASH functions, etc.

FIGS. 15A-C illustrate operation of the auto-increment mode of theauto-change address modes described above in accordance with anembodiment of the present invention. FIGS. 15A-C depict a register bank130 having a plurality of registers 132, such as may be included in theindirect register set 104. As described above, writing to the indirectbank select register 112 sets the address of the desired register bank130, the auto-change address bits that indicate the auto-change addressmode, and resets the indirect address select register 114 to apredetermined address, such as zero. Thus, to setup indirect access tothe bank 130 and registers 132, only one write cycle is needed, asopposed to separate write cycles, to first write to the indirect bankselect register 112, determine the auto change address mode, and thenselect the indirect address register 114 as zero, for example.

After writing to the indirect bank select register 112 to select thebank 130, data may be written to or read from the indirect data in/outregister 116 if the indirect register address <0> is the desiredindirect register of the selected bank 130. If a different indirectregister needs to be accessed, then the indirect address select register114 is written to with the desired register address to select a specificregister. For example, as shown in FIG. 15A, a first register 134 of thebank 130 having a address of “<address>” may be selected through theindirect bank select register 112 and the indirect address selectregister 114. After selecting the register 134, data may be written toor read from the indirect data in/out register 116.

In auto-increment mode, the current register address “<address>” set inthe indirect address select register 114 automatically increments afterwriting the first register 134, as illustrated by arrow 136 in FIG. 15B.The next write cycle writes to a second register 138 having a registeraddress of “<address>+1.” Thus, the next register 138 is written withouthaving to rewrite to the indirect bank select register 112 or theindirect address select register 114. Similarly, the next write cycle,as illustrated in FIG. 15C, increments the currently selected address“<address>+1” by one, as illustrated by arrow 140. The next write writesto a third register 142 having a register address of “<address>+2.” Thewriting cycles continue writing to incremented register addresses untilthe end of the bank 130. The auto-increment mode allows bursts ofaccesses to successive registers 134, 138, 142, and so on, increasingthe speed of writing or reading large banks of indirect registers.

FIGS. 16A-C illustrate operation of the auto-decrement mode of theauto-change address modes on the bank 130 and bank registers 132 inaccordance with an embodiment of the present invention. As describedabove, writing to the indirect bank select register 112 sets theregister bank 130 to be written, the auto-decrement mode via theauto-change address bits, and resets the indirect address selectregister 114 to zero (or some other predetermined value). After theindirect bank select address 112 is set, the indirect address selectregister 114 is set to select a specific register, such as the register146 having an address of “<address>.” For example, as shown in FIG. 16A,a first register 146 of the bank 130 may be written by writing to theindirect data in/out register 116. In auto-decrement mode, the currentregister address “<address>” automatically decrements by one addressvalue after writing the first register 146, as illustrated by arrow 148in FIG. 16B. The next write cycle writes to a second register 150 havinga register address of “<address>−1.” After this write cycle, thecurrently selected register address “<address>−1” is decremented by oneaddress value, as indicated by arrow 152 in FIG. 15C The next writecycle writes to a third register 154 having a register address of“<address>−2.” Successive write cycles continually decrement thecurrently selected indirect register address until the end of the bank130. As with the auto-increment mode, the auto-decrement mode providesfor reading or writing data to registers 132 in bursts of accesses tosuccessive registers 146, 150, 154, and so on, increasing the speed ofwriting or reading large banks of registers.

The additional auto-change address modes referred to above, auto-resetmode and no change, may be used when no increment or decrementfunctionality is desired. For example, the no-change mode may be used ifthe currently accessed register is a status, interrupt, or otherfunction having only one register in a bank, such that no burst read orwrites are desired. An “auto-reset-to-zero” mode may be used when theindirect register address <0> is frequently read or written, but anotherindirect register is occasionally read or written.

FIG. 17 depicts a process 200 for writing to or reading from theindirect registers 104 in accordance with an embodiment of the presentinvention. A write or read operation begins by writing the desired bankaddress to the indirect bank select register 112 (block 202). In thepresent embodiment, writing the indirect bank select register 112 setsthe indirect address select register 114 to zero, e.g., 0x00000000h fora 32-bit register (block 204). The auto-change address mode is set bythe dedicated auto-change address mode bits written to the indirect bankaddress register 112 (block 206). As illustrated in the FIG. 17, theblocks 202, 204, and 206 occur in one write cycle, as indicated bydashed area 208. That is, the write to the indirect bank select register112 results in automatic execution of the blocks 204 and 206 of theprocess 200.

The specific register address to be written, referred to as “<address>,”is written to the indirect address select register 114 (block 210). Datais written to or read from the register at “<address>,” depending on therequested operation, via the indirect data in/out register 116 (block212).

The auto-change address mode received from the indirect bank selectregister 112 then determines if the currently accessed register address<address> is modified. If the auto-change address mode is auto-incrementmode, as indicated by arrow 214, the “<address>” of the current registeraddress increments by one (block 216). The next successive register inthe selected bank is written or read (block 218). If the end of the bankhas not been reached (decision block 220), the process 200 may continueto increment the current address at block 216 until the end of the bank.It should be appreciated that the auto-decrement mode functionssimilarly, except the current register address “<address>” decrements byone in block 216. In one embodiment, various further actions may betaken (block 222) if the end of the bank has been reached. By way ofexample, in one embodiment, further writing to the selected registerbank may be prevented and an error condition may be indicated if anotherwrite is attempted. In other embodiments, the current address may bereset to the first address (in auto-increment mode) or last address (inauto-decrement mode) of the selected bank, the selected bank in theindirect bank select register 112 may be incremented or decremented(depending on the current auto-change mode), some other action may betaken, or some combination of these actions may be performed. Forinstance, in an auto-increment mode, once the end of a bank is reached,the indirect bank select register value may be incremented, and theindirect address select register value may be set to zero or some othervalue.

Alternatively, if the auto-change address mode is the return-to-zeromode as indicated by arrow 224, the indirect address select register isreset to zero, e.g., 0x00000000h for a 32-bit register (block 226). Ifthe auto-change address mode is no-change, as indicated by arrow 228,then no change is made to the indirect address select register (block230), e.g., the indirect address select register remains set at thecurrent register address “<address>.”

While the invention may be susceptible to various modifications andalternative forms, specific embodiments have been shown by way ofexample in the drawings and have been described in detail herein.However, it should be understood that the invention is not intended tobe limited to the particular forms disclosed. Rather, the invention isto cover all modifications, equivalents, and alternatives falling withinthe spirit and scope of the invention as defined by the followingappended claims.

1. A system comprising: a plurality of registers, wherein the pluralityof registers comprises: a first set of registers directly accessible bya device; and a second set of registers indirectly accessible by thedevice via the first set of registers; wherein the first set ofregisters includes a first subset of registers that enable indirectaccess to the second set of registers by the device, and a second subsetof registers different from the first subset; and a pattern-recognitionprocessor, comprising: a row decoder having an input configured toreceive a data stream to be searched; and a plurality of feature cellscoupled to the row decoder, wherein each of the plurality of featurecells comprise a plurality of memory cells each addressable by aconductor coupled to an output of the row decoder.
 2. The system ofclaim 1, wherein the first set of registers comprises an indirect bankselect register configured to store a bank address of the second set ofregisters.
 3. The system of claim 1, wherein the first set of registerscomprises an indirect address select register configured to store anaddress of a register of the second set of registers.
 4. The system ofclaim 1, wherein the first set of registers comprises a data registerconfigured to write to or read from a register of the second set ofregisters.
 5. The system of claim 1, wherein the second subset ofregisters comprises at least one of a status register, a controlregister, or an input register.
 6. The system of claim 1, wherein thefirst set of registers comprises a register configured to store one ormore bits to indicate an auto-change mode.
 7. The system of claim 1,comprising access logic configured to manage access to the first set ofregisters and the second set of registers.
 8. The system of claim 7,wherein the pattern-recognition processor includes the access logic. 9.The system of claim 7, wherein the access logic is separate from andaccessible by the pattern-recognition processor.
 10. The system of claim7, wherein the access logic is configured to read an auto-change modefrom a first register of the first set of registers.
 11. The system ofclaim 10, wherein the access logic is configured to set a secondregister of the first set of registers to a predetermined value.
 12. Thesystem of claim 1, wherein the second set of registers comprises one ormore banks of registers.
 13. A method of processing data, comprising:reading an auto-change mode from a first register of a first set ofregisters; selecting the auto-change mode from a plurality ofauto-change modes based on the first register, wherein the plurality ofauto-change mode comprises: an auto-increment mode in which a firstaddress stored in the address register of the first set of registers isincremented at the completion of a bus cycle; an auto-decrement mode inwhich a first address stored in the address register of the first set ofregisters is decremented at the completion of the bus cycle; and anauto-reset mode in which the address register is set to a predeterminedvalue at the complementation of the bus cycle; reading an address from asecond register of the first set of registers; accessing a firstregister of a second set of registers at the address; and automaticallymodifying the address based on the auto-change mode.
 14. The method ofclaim 13, wherein modifying the address comprises incrementing theaddress.
 15. The method of claim 13, wherein modifying the addresscomprises decrementing the address.
 16. The method of claim 13, whereinmodifying the address comprises setting the address to a predeterminedvalue.
 17. The method of claim 16, wherein setting the address to apredetermined value comprises setting the address to zero.
 18. Themethod of claim 13, comprising automatically modifying a bank selectregister of the first set of registers based on the auto-change mode.19. The method of claim 18, wherein automatically modifying a bankselect register includes modifying the first register of the first setof registers.
 20. A method of processing data, comprising: writing aselected bank address to an indirect bank select register during a firstclock cycle; writing the selected bank address to an indirect addressselect register; processing data at a register corresponding to theselected bank address via an indirect data in/out register; anddetermining whether the selected bank address is modified;
 21. Themethod of claim 20, wherein writing the selected bank address comprisessetting the indirect bank select register to zero.
 22. The method ofclaim 20, comprising automatically setting an auto-change address modeduring the first clock cycle after writing the selected bank address.23. The method of claim 20, wherein processing data at a registercorresponding to the selected bank address comprises writing data to theregister corresponding to the selected bank address.
 24. The method ofclaim 20, wherein determining whether the selected bank address ismodified comprises determining whether an auto-change address mode isone of an auto-increment mode, a return-to-zero mode or no-change. 25.The method of claim 24, wherein if the auto-change address mode is anauto-increment mode, the method further comprises: incrementing theselected bank address by one to produce a new selected bank address; andwriting to the new selected bank address.
 26. The method of claim 25,further comprising: determining whether an end of bank has been reached;and if the end of bank has not been reached, continuing to increment theselected bank address by one until the end of bank is reached, if theend of bank has been reached, performing another action.
 27. The methodof claim 26, wherein performing another action comprises: preventingfurther write actions to the bank; and generating an error condition offurther write actions to the bank are attempted.
 28. The method of claim24, wherein if the auto-change address mode is a return-to-zero mode,resetting the indirect address select register to zero.